NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
651	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner† Add to Reading List Source URL: www.user.tu-berlin.de Language: English - Date: 2013-01-21 07:14:53 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Kernelization Clique Intersection number Graph Path decomposition Graph theory Theoretical computer science Mathematics
652	Optim Lett:287–295 DOIs11590ORIGINAL PAPER A generalization of the Motzkin–Straus theorem to hypergraphs Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:22 Clique Extremal graph theory Hypergraph Degree Line graph Graph structure theorem Graph theory NP-complete problems Graph operations
653	Mungo’s Crossword N023 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-06-16 21:54:27 Crosswords NP-complete problems Cryptic crossword
654	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-04-18 21:30:54 NP-complete problems Operations research Combinatorial optimization Linear programming Travelling salesman problem Linear programming relaxation Relaxation Graph Shortest path problem Theoretical computer science Mathematics Graph theory
655	Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-22 17:08:40 Graph coloring NP-complete problems List coloring Parameterized complexity Kernelization Vertex cover Independent set Edge coloring Complete coloring Graph theory Theoretical computer science Mathematics
656	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
657	Irene Moulitsas and George Karypis University of Minnesota, Department of Computer Science / Army HPC Research Center Minneapolis, MN 55455 moulitsa, karypis @cs.umn.edu Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2001-12-10 13:46:18 Mesh generation NP-complete problems Multigrid method Numerical analysis Wavelets Graph partition Unstructured grid Regular grid Biconnected component Mathematics Theoretical computer science Graph theory
658	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 15 May 2013 This question paper has 4 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2014-02-28 00:18:08 Applied mathematics Binomial coefficient Fractional cascading Mathematics Logarithms NP-complete problems
659	Mungo’s Crossword N016 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-05-05 21:40:39 Crosswords NP-complete problems Cryptic crossword
660	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory

UPDATE